Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes
ثبت نشده
چکیده
q 3 q 1 q 1 q 1 q 3 j j+1 i-1 i-2-1 0 D activated by P activated by P j 0 Fig. 10. Two processes entering region D. 27 q 0. .. p p q q q q q q q 1 1 1 1 1 1 1. .. .. . p 0 p p p q 3 p q j 0 q 1 q q q 1 1. .. 0 q 1 q q q 1 1. .. 0 q r 3-d r +d q 3 16 3 16 q 1 17 9-d +d q 1 9 11 9-d +d 11 q 0 9 10-b +b q 0 +ack-ack 10
منابع مشابه
Computational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملA Companion of "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities"
In the paper “Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities” to appear in Theoretical Computer Science, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular, we consider strong trace, failure, testing, and bisimulation equivalences. For each of these groups of equivalences, we examine the...
متن کاملOn the Complexity of Deciding Behavioural Equivalences and Preorders A Survey
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes. A distinction, which turns out to be important in the finite-state processes, is that of simulation-like eq...
متن کامل